Recurrence relations for exceptional Hermite polynomials

Zeros of exceptional Hermite polynomials

Exceptional orthogonal polynomials were introduced by Gomez-Ullate, Kamran and Milson as polynomial eigenfunctions of second order differential equations with the remarkable property that some degrees are missing, i.e., there is not a polynomial for every degree. However, they do constitute a complete orthogonal system with respect to a weight function that is typically a rational modification ...

Exceptional Charlier and Hermite orthogonal polynomials

Using Casorati determinants of Charlier polynomials (ca n )n , we construct for each finite set F of positive integers a sequence of polynomials cF n , n ∈ σF , which are eigenfunctions of a second order difference operator, where σF is certain infinite set of nonnegative integers, σF ( N. For suitable finite sets F (we call them admissible sets), we prove that the polynomials cF n , n ∈ σF , a...

New relations for two-dimensional Hermite polynomials

The effective formulas reducing the two-dimensional Hermite polynomials to the classical (one-dimensional) orthogonal polynomials are given. New one-parameter generating functions for these polynomials are derived. Asymptotical formulas for large values of indices are found. The applications to the squeezed one-mode states and to the time-dependent quantum harmonic oscillator are considered.

Linear Recurrence Relations for Graph Polynomials

A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...

Asymptotics of Orthogonal Polynomials via Recurrence Relations